Generating 3D Plants using Lindenmayer System

نویسندگان

  • Kamil Ciosek
  • Pawel Kotowski
چکیده

The main focus of this paper is the analysis of modern methods of algorithmic plant generation. First, a brief introduction is given to the necessary formalism: Lindenmayer system. It is followed by a description of each stage of plant generation process. These include algorithms for obtaining: leaf venation graph, leaf texture, stem texture, and the geometry and topology of the whole plant. In particular, the following approaches have been used: textures are obtained from transformed noise, a general plant description is generated with a parametric Lindenmayer system and a purpose-built particle-based algorithm is used to simulate leaf venation. The last section gives a detailed description of four sample systems used to generate different plants, outlining the reasons why a given system gives the desired graphical result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method for Generating Phyllotaxis over Surfaces of Revolution

This paper describes a method for generating phyllotaxis on surfaces of revolution. It extends the work done by previous authors in using Lindenmayer systems (L-systems) to model phyllotaxis in plants for the purposes of generating realistic visual models. The method described permits placement of small elements in phyllotactic patterns over surfaces of revolution. An area-based phyllotactic mo...

متن کامل

Turtle geometry

This chapter gives a cursory introduction to the field of Turtle geometry. Developed as part of a programming language, Turtle geometry is used as both an instrument to teach math to children and as a tool for generating pictures using grammars. It is the latter which will be the topic of this chapter. Two definitions of Turtle geometry will be given, as well as an example to illustrate the use...

متن کامل

Accepting Grammars and Systems: An Overview

We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In a lot of cases, accepting mode turns out to be exactly as powerful...

متن کامل

Accepting Grammars and Systems

We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...

متن کامل

On Genetic Algorithms and Lindenmayer Systems

This paper describes a system for simulating the evolution of artificial 2D plant morphologies. Virtual plant genotypes are inspired by the mathematical formalism known as Lindenmayer systems (L-systems). The phenotypes are the branching structures resulting from the derivation and graphic interpretation of the genotypes. Evolution is simulated using a genetic algorithm with a fitness function ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009